The Geometry of Cubic Polynomials
نویسندگان
چکیده
Given a complex cubic polynomial p(z) = (z − 1)(z − r1)(z − r2) with |r1| = 1 = |r2|, where are the critical points? Marden’s Theorem tells us that the critical points are the foci of the Steiner ellipse of 41r1r2. In this paper we further explore the structure of these critical points. If we let Tγ be the circle of diameter γ passing through 1 and 1 − γ, then there are α, β ∈ [0, 2] such that the critical points of p lie on the circles Tα and Tβ respectively. We show that Tβ is the inversion of Tα over T1, from which many nice geometric consequences can be drawn. For example, (1) there is a “desert” in the unit disk, the open disk {z ∈ C : |z − 2 3 | < 1 3 }, in which critical points cannot occur, and (2) a critical point of such a polynomial almost always determines the polynomial uniquely.
منابع مشابه
A Final Report on the SAIF Grant, 2014-2015
My research plan was to study the geometry of cubic polynomials. After an exhaustive study of the literature, I was able to answer the question that was posed. Starting with a given critical point (in a specified region of the unit disk) I was able to reconstruct the associated unique polynomial (in a special class of cubic polynomials) both geometrically and analytically. After this, I coautho...
متن کاملThe Geometry of the Critically Periodic Curves in the Space of Cubic Polynomials
We provide an algorithm for computing the Euler characteristic of the curves Sp in P 3 ' C, consisting of all polynomials with a periodic critical point of period p in the space of critically-marked, complex, cubic polynomials. The curves were introduced in [Mi, BKM], and the algorithm applies the main results of [DP]. The output is shown for periods p ≤ 26.
متن کاملON THE EDGE COVER POLYNOMIAL OF CERTAIN GRAPHS
Let $G$ be a simple graph of order $n$ and size $m$.The edge covering of $G$ is a set of edges such that every vertex of $G$ is incident to at least one edge of the set. The edge cover polynomial of $G$ is the polynomial$E(G,x)=sum_{i=rho(G)}^{m} e(G,i) x^{i}$,where $e(G,i)$ is the number of edge coverings of $G$ of size $i$, and$rho(G)$ is the edge covering number of $G$. In this paper we stud...
متن کاملSpecial geometry, cubic polynomials and homogeneous quaternionic spaces
The existing classification of homogeneous quaternionic spaces is not complete. We study these spaces in the context of certain N = 2 supergravity theories, where dimensional reduction induces a mapping between special real, Kähler and quaternionic spaces. The geometry of the real spaces is encoded in cubic polynomials, those of the Kähler and quaternionic manifolds in homogeneous holomorphic f...
متن کاملA ug 1 99 9 The projective geometry of Freudenthal ’ s magic square
We connect the algebraic geometry and representation theory associated to Freudenthal's magic square. We give unified geometric descriptions of several classes of orbit closures, describing their hyperplane sections and desingularizations, and interpreting them in terms of composition algebras. In particular, we show how a class of invariant quartic polynomials can be viewed as generalizations ...
متن کاملGeometry of Cubic Polynomials
Imagine a sphere with its equator inscribed in an equilateral triangle. This Saturn-like figure will help us understand from where Cardano’s formula for finding the roots of a cubic polynomial p(z) comes. It will also help us find a new proof of Marden’s theorem, the surprising result that the roots of the derivative p(z) are the foci of the ellipse inscribed in and tangent to the midpoints of ...
متن کامل